DDD: Distributed Dataset DNS

نویسندگان

چکیده

Abstract The advent of inexpensive data storage has resulted in larger and datasets as the cost pruning becomes more expensive then storing it for future insights. This decreasing also led to practice multiple locations redundancy. However, without any uniform method determining link costs different sites, a dataset is not always retrieved from most effective site. Distributed DNS, or DDD, solves this problem two key ways. first allows “local” servers provide meaningful information user order ensure that they target location offers advantageous network connection. second other trusted easily gain access distributed way. These combined approaches aim both lower aggregate bandwidth usage prevent single points failure when retrieving pointers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Highly - Available Redundantly - Distributed DNS

The DNS or Domain Name System is a critical piece of the Internet infrastructure. In recent times there have been numerous attacks on DNS, the Kaminsky attack being one of the more insidious ones. Current solutions to the problem involve patching the DNS software (Bind) and/or using DNSSEC. Unfortunately, these are forklift upgrades of the DNS infrastructure and are not always feasible especial...

متن کامل

Exploiting Dataset Similarity for Distributed Mining

The notion of similarity is an important one in data mining. It can be used to provide useful structural information on data as well as enable clustering. In this paper we present an elegant method for measuring the similarity between homogeneous datasets. The algorithm presented is eÆcient in storage and scale, has the ability to adjust to time constraints. and can provide the user with likely...

متن کامل

A global distributed basin morphometric dataset

Basin morphometry is vital information for relating storms to hydrologic hazards, such as landslides and floods. In this paper we present the first comprehensive global dataset of distributed basin morphometry at 30 arc seconds resolution. The dataset includes nine prime morphometric variables; in addition we present formulas for generating twenty-one additional morphometric variables based on ...

متن کامل

Distributed Measurement-based Analysis of Anycast Public DNS Resolvers

The use of public DNS resolvers in constantly increasing. Most of these resolvers use anycast. This allows several instances of the same server to have the same IP address, allowing the user to connect to the one that is most beneficial to him. By comparing the performance of the most popular of these resolvers, the research described in this paper provides insight into the performance of these...

متن کامل

DDD distribution in Erlang

Decision diagrams are structures used in several domains where memory usage is critical. Data Decision Diagrams (DDD) are a kind of decision diagrams used in model-checking for example. However, they bring a solution to the memory problem that is not always sufficient. To overcome memory limit, a solution is to distribute memory. Some implementations exist for BDD (Binary Decision Diagrams), bu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cluster Computing

سال: 2022

ISSN: ['1386-7857', '1573-7543']

DOI: https://doi.org/10.1007/s10586-021-03515-w